package bTree.LeetCode;

public class 阶乘后的零 {
    public int trailingZeroes(int n) {
        int cnt=0;
        while (n!=0){
            cnt+=n/5;
            n/=5;
        }
        return cnt;
    }
}